System for matching media files

ABSTRACT

A computing system includes an interface configured to interface and communicate with an external media resource, a memory that stores operational instructions and a processing module operably coupled to the interface and to the memory, such that the processing module, when operable within the computing system based on the operational instructions, is configured to is configured to perform various operations. The computing system receives an audio fingerprint from the external medial resource, compares the received audio fingerprint with a stored audio fingerprint and in response to determining that a portion of a stored audio fingerprint substantially matches a portion of the received audio fingerprint, compares a first set of consecutive portions of of the received audio fingerprint to each of a plurality of consecutive portions of the stored audio fingerprint to generate corresponding match scores. The computing system identifies a longest unordered match as a number of consecutive portions of the first set that each have a corresponding highest match score satisfying a similarity threshold and when the longest unordered match compares favorably to a length criterion, determines a match between the received audio fingerprint and the stored audio fingerprint.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present U.S. Utility Patent Application claims priority pursuant to35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No.17/060,589, entitled “UNORDERED MATCHING OF AUDIO FINGERPRINTS”, filedOct. 1, 2020, which claims priority pursuant to 35 U.S.C. § 120 as acontinuation of U.S. Utility application Ser. No. 16/744,423, entitled“UNORDERED MATCHING OF AUDIO FINGERPRINTS”, filed Jan. 16, 2020, issuedas U.S. Pat. No. 10,810,254 on Oct. 20, 2020, which is a continuation ofU.S. Utility application Ser. No. 16/037,346, entitled “UNORDEREDMATCHING OF AUDIO FINGERPRINTS”, filed Jul. 17, 2018, issued as U.S.Pat. No. 10,540,395 on Jan. 21, 2020, which is a continuation of U.S.Utility application Ser. No. 15/282,691, entitled “UNORDERED MATCHING OFAUDIO FINGERPRINTS,” filed Sep. 30, 2016, issued as U.S. Pat. No.10,146,866 on Dec. 4, 2018, which is a continuation of U.S. Utilityapplication Ser. No. 13/887,988, entitled “UNORDERED MATCHING OF AUDIOFINGERPRINTS,” filed May 6, 2013, issued as U.S. Pat. No. 9,460,201 onOct. 4, 2016, all of which are hereby incorporated herein by referencein their entirety and made part of the present U.S. Utility PatentApplication for all purposes.

BACKGROUND

Audio fingerprint matching is a process that may be used to identifysongs or other items of recorded audio content. For example, a user mayuse an application executing on a mobile device (e.g., a cellulartelephone) to record a segment of a song that the user wishes toidentify. The mobile application may compare (or may cause a server tocompare) the recorded audio segment to known audio segments in adatabase to identify the song.

To determine whether an unknown audio segment matches a known audiosegment, an ordered comparison between the segments may be performed.Performing the ordered comparison may include selecting a portion of theknown audio segment and comparing the selected portion to each portionof the unknown audio segment. When a match is detected, neighboring(i.e., temporally adjacent) portions of the audio segments may becompared in an attempt to “grow” the match backwards and forwards intime. For example, if the initially selected portion of the unknownaudio segment is denoted U and its matching portion in the known audiosegment is denoted K, growing the match includes comparing portion U−1with portion K−1 and portion U+1 with portion K+1, comparing portion U−2with portion K−2 and portion U+2 with portion K+2, etc. If enough of theneighboring portions also match (i.e., the match grows past a thresholdamount), an overall match between the known and unknown audio segmentsis determined.

However, if the unknown audio segment recorded by the user has noise ordistortion, the wrong song, or no song, may be identified. Further, ifthe version of the song recorded by the user is time-stretched ortime-squeezed, ordered matching processes may not correctly identify thesong, even though the song is in the database. Such time-stretching ortime-squeezing may be introduced by radio stations so that a song orsequence of songs fits into a fixed duration of time. Time-stretching ortime-squeezing may also occur due to natural differences between liveperformances and recorded songs. In addition, performing orderedcomparisons may consume a large amount of processing resources and thedatabase of known songs may occupy a large amount of memory.

SUMMARY

Systems and methods of performing unordered matching of audiofingerprints are disclosed. In accordance with the described techniques,audio fingerprints may be generated from known and unknown audiosegments via spectral analysis. To perform an unordered comparison, aportion of the known audio fingerprint may be selected as a probe. Theprobe may be “scrubbed” against portions of the unknown audiofingerprint until a match between the probe and a particular portion ofthe unknown audio fingerprint is detected. In contrast to orderedcomparison processes, the described techniques do not attempt totemporally “grow” the match outwards from the probe. Instead, the knownfingerprint may be divided into Y portions, and each of the Y portionsof the known audio fingerprint may be scrubbed against each of Xportions of the unknown audio fingerprint, thereby generating X*Y matchscores that can be visualized as an undulating surface. The highestmatch score for each of the X portions may be identified, which can bevisualized as a bar graph. The bar graph can be divided into alternating“runs” of match scores that are consecutively above or below asimilarity threshold. If the longest run of above-threshold match scoressatisfies a length criterion, a match between the known and unknownaudio segments may be detected. Length criteria may vary depending onthe programming element (e.g., advertisement vs. song) and station(e.g., radio station, television channel, Internet media source, etc.)associated with the known audio fingerprint.

In certain implementations, additional fingerprint matching operationsmay be performed. For example, because each portion of the unknown audiofingerprint is compared to each portion of the known audio fingerprint,the same portion of the known audio fingerprint may be determined as theclosest match for multiple portions of the unknown audio fingerprint. Tocontrol whether such repetition is permitted, a disorder penalty may beapplied when determining the highest match score for each of the Xportions. A disorder threshold may represent how many times a specificportion of the known fingerprint can be repeated in the unknownfingerprint. As another example, unordered matching may result in adetermination that two consecutive portions of the unknown audiofingerprint most closely match two non-consecutive portions of the knownaudio fingerprint. In such situations, a positional penalty can beapplied by scaling down match scores.

In a particular aspect, a method includes determining, at a processor ofa device, an unordered match between a set of consecutive portions of afirst audio fingerprint and a set of non-consecutive portions of asecond audio fingerprint. The method also includes, in response todetermining that a length of the unordered match satisfies a lengthcriterion, outputting an indicator that the first audio fingerprintmatches the second audio fingerprint.

In another particular aspect, an apparatus includes a processor. Theprocessor is configured to determine an unordered match between a set ofconsecutive portions of a first audio fingerprint and a set ofnon-consecutive portions of a second audio fingerprint. The processor isalso configured to, in response to determining that a length of theunordered match satisfies a length criterion, generate an indicator thatthe first audio fingerprint matches the second audio fingerprint.

In another particular aspect, a computer-readable storage device storesinstructions that, when executed by a computer, cause the computer toperform operations including determining an unordered match between aset of consecutive portions of a first audio fingerprint and a set ofnon-consecutive portions of a second audio fingerprint. The operationsalso include, in response to determining that a length of the unorderedmatch satisfies a length criterion, outputting an indicator that thefirst audio fingerprint matches the second audio fingerprint.

In another particular aspect, a method includes receiving an audiofingerprint from a listening device. The method also includes, inresponse to determining that a portion of a stored audio fingerprintsubstantially matches a portion of the received audio fingerprint,identifying a longest unordered match between the received audiofingerprint and the stored audio fingerprint that satisfies a similaritythreshold. The method further includes, in response to determining thatthe identified longest unordered match satisfies a length criterion,detecting a match between the received audio fingerprint and the storedaudio fingerprint.

In another particular aspect, an apparatus includes a network interfaceconfigured to receive an audio fingerprint from a listening device. Theapparatus also includes a processor and a memory storing instructionsthat, when executed by the processor, cause the processor to performoperations. The operations include, in response to determining that aportion of a stored audio fingerprint substantially matches a portion ofthe received audio fingerprint, identifying a longest unordered matchbetween the received audio fingerprint and the stored audio fingerprintthat satisfies a similarity threshold. The operations also include, inresponse to determining that the identified longest unordered matchsatisfies a length criterion, detecting a match between the receivedaudio fingerprint and the stored audio fingerprint.

In another particular aspect, a computer-readable storage device storesinstructions that, when executed by a computer, cause the computer toperform operations including receiving an audio fingerprint from alistening device. The operations also include, in response todetermining that a portion of a stored audio fingerprint substantiallymatches a portion of the received audio fingerprint, identifying alongest unordered match between the received audio fingerprint and thestored audio fingerprint that satisfies a similarity threshold. Theoperations further include, in response to determining that theidentified longest unordered match satisfies a length criterion,detecting a match between the received audio fingerprint and the storedaudio fingerprint. Identifying the longest unordered match includesscaling at least one match score when consecutive portions of thereceived audio fingerprint are determined to be similar tonon-consecutive portions of the stored audio fingerprint.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is diagram to illustrate a particular aspect of a system that isoperable to perform unordered matching of audio fingerprints;

FIG. 2 is a diagram to illustrate a particular aspect of computing matchscores during unordered matching of audio fingerprints;

FIG. 3 is a table corresponding to the match scores of FIG. 2 ;

FIG. 4 is an illustrative aspect of a surface graph corresponding to thetable of FIG. 3 ;

FIG. 5 is a bar graph to illustrate highest match scores identifiedbased on the table of FIG. 3 ;

FIG. 6 is a bar graph to illustrate application of a disorder penalty;

FIG. 7 is a bar graph to illustrate application of a positional penalty;

FIG. 8 is a bar graph to illustrate a particular aspect of averagingmatch scores;

FIG. 9 is a bar graph to illustrate another particular aspect ofaveraging match scores;

FIG. 10 is a flow chart to illustrate a particular aspect of a method ofperforming unordered matching of audio fingerprints;

FIG. 11 is a flow chart to illustrate a particular aspect of a method ofidentifying a longest unordered match;

FIG. 12 is a flow chart to illustrate a particular aspect of a method ofidentifying a longest unordered match based on a list of runs; and

FIG. 13 is a block diagram of an illustrative aspect of a generalcomputer system operable to support aspects of computer-implementedmethods, computer program products, and system components as illustratedin FIGS. 1-12 .

DETAILED DESCRIPTION

FIG. 1 illustrates a particular aspect of a system 100 that is operableto perform unordered matching of audio fingerprints. The system 100 mayinclude one or more audio sources, such as radio stations, televisionchannels, and Internet media sources. In the illustrated example, thesystem 100 includes a first antenna 110 corresponding to a first radiostation and a second antenna 150 corresponding to a second radiostation. The system 100 may also include one or more listening devices(e.g., an illustrative listening device 122 corresponding to a user 121)and one or more field recorders (e.g., illustrative field recorders 130and 160). In a particular aspect, at least one field recorder may bepresent for each audio source in the system 100. The system 100 mayfurther include a server 140 that can send data to and receive data fromthe listening device 122 and the field recorders 130, 160 (e.g., via anetwork, such as the Internet).

The listening device 122 may be a mobile telephone, a personal mediamonitor, or another electronic device that includes a microphone orother audio capture device. In a particular aspect, the listening device122 includes a software application and/or hardware componentsconfigured to record ambient audio, convert the recorded audio data fromanalog to digital audio data, and perform spectral analysis of thedigital audio data to generate a first audio fingerprint 123. Thelistening device 122 may transmit the first audio fingerprint 123 to theserver 140. For example, the first audio fingerprint 123 may betransmitted via a network (e.g., the Internet) using a wireless dataconnection (e.g., an institute of electrical and electronics engineers(IEEE) 802.11 connection), a mobile communication connection, etc.Examples of mobile communications systems include, but are not limitedto, third generation (3G) systems (e.g., enhanced data rates for globalsystem for mobile communications (GSM) evolution (EDGE), code divisionmultiple access (CDMA) 2000 (CDMA2000), and universal mobiletelecommunications system (UMTS)) and fourth generation (4G) systems(e.g., long term evolution (LTE) advanced (LTE-A) and mobile worldwideinteroperability for microwave access release 2 (Mobile WiMAX Release2)). In a particular aspect, the first audio fingerprint 123 isgenerated in response to user input (e.g., the user activating a song orstation identification application on the listening device).Alternately, the first audio fingerprint 123 may be generatedautomatically (e.g., the listening device 122 may be a personal mediamonitor that the user 121 has agreed to carry, so that a monitoringservice can use data received from numerous such listening devices todetermine radio listenership, television ratings, etc.).

In a particular aspect, the first audio fingerprint 123 may beconsidered an “unknown” audio fingerprint, because the server 140 doesnot receive or have access to identification information (e.g.,metadata) regarding the unknown audio fingerprint. The first audiofingerprint 123 may include or may be accompanied with a timestampand/or information identifying or otherwise describing the user 121associated with the listening device 122.

The field recorders 130 and 160 may be computing devices that include amicrophone or other audio capture device. The field recorders 130 and160 may be put in the field by a monitoring service or other commercialentity. The field recorders 130 and 160 may include softwareapplication(s) and/or hardware components configured to record the audiosignals transmitted by the antennas 110 and 150, respectively. Each ofthe field recorders 130 and 160 may be configured to convert recordedanalog audio to digital audio data and to generate audio fingerprints byperforming spectral analysis on the digital audio data. For example, thefirst field recorder 130 includes an analog-to-digital conversion module131 and a fingerprint module 132. Although not shown in FIG. 1 , thesecond field recorder 160 may include similar modules. The fieldrecorders 130 and 160 may transmit audio fingerprints to the server 140via a network, such as the Internet. For example, in FIG. 1 , the fieldrecorder 130 transmits a second audio fingerprint 133 to the server 140.In a particular aspect, the field recorders 130 and 160 transmit audiofingerprints to the server 140 in accordance with a configurableperiodicity. Because each of the field recorders 130 and 160 is assignedto a particular station, the audio fingerprints transmitted by the fieldrecorders 130 and 160 to the server 140 may include or may beaccompanied with station identification information (e.g., metadataidentifying a radio station, a television channel, or an Internet mediasource) in addition to a timestamp. Thus, the second audio fingerprint133 may be considered a “known” audio fingerprint. In a particularaspect, known audio fingerprints may also identify, or may include or beaccompanied with data that can be used to identify, a song title, anartist, and an album in the case of a song, an advertisement name and anadvertiser in the case of an advertisement, etc.

In an alternate aspect, the field recorders 130 and 160 generate andtransmit encoded audio streams to the server 140, and the server 140generates audio fingerprints based on the encoded audio streams.Similarly, the listening device 122 may generate and transmit an encodedaudio file to the server 140, and the server 140 may generate an audiofingerprint (e.g., the first audio fingerprint 123) based on thereceived audio file.

The server 140 may be a network-accessible computing device (e.g., acloud computing server) that receives audio fingerprints from fieldrecorders (e.g., the field recorders 130 and 160) and listening devices(e.g., the listening device 122). The server 140 may include anunordered fingerprint matching module 142, length criteria 144, and adata store 146. Alternately, the data store 146 may be located remote tothe server 140 and may be accessible to the server 140 via a network.The data store 146 may store audio fingerprints received from fieldrecorders and/or listening devices. For example, the data store 146 mayinclude circular buffers (e.g., first-in-first-out (FIFO) orlast-in-first-out (LIFO) buffers) for each monitored station. In aparticular aspect, the data store 146 may maintain audio fingerprintscorresponding to approximately eight days of audio transmissions of eachmonitored station.

The unordered fingerprint matching module 142 may perform unorderedcomparisons between an audio fingerprint received from a listeningdevice and a stored audio fingerprint retrieved from the data store 146.In a particular aspect, the server 140 is configured to compare an audiofingerprint received from a listening device to multiple stored audiofingerprints simultaneously (e.g., by providing copies of the receivedaudio fingerprint to each of multiple unordered fingerprint matchingmodules). To illustrate, the server 140 may store the second audiofingerprint 133 received from the field recorder 130 in the data store146. Upon receipt of the first audio fingerprint 123, the unorderedfingerprint matching module 142 may retrieve the second audiofingerprint 133 from the data store 146 and may perform an unorderedcomparison between the audio fingerprints 123 and 133. In a particularaspect, the unordered comparison results in identification of a longest“run” (e.g., segment) of the unknown audio fingerprint 123 thatsufficiently matches a segment of the known audio fingerprint 133. Theunordered fingerprint matching module 142 may determine whether thelongest run satisfies one or more of the length criteria 144. In aparticular aspect, the length criteria 144 may vary by programmingelement. For example, if metadata indicates that the second audiofingerprint 133 represents an advertisement, the longest run may need tobe 80% of the length of the second audio fingerprint 133 for a match tobe detected. As another example, if the second audio fingerprint 133represents a song, the longest run may need to be 90% of the length ofthe second audio fingerprint 133 for a match to be detected. The lengthcriteria 144 may also vary by station. To illustrate, the first stationassociated with the first antenna 110 may have different length criteriathan the second station associated with the second antenna 150. In aparticular aspect, the length criteria 144 may be user-configurable.Examples of unordered fingerprint matching are further described withreference to FIGS. 2-12 .

During operation, the field recorders 130 and 160 may generate andtransmit audio fingerprints to the server 140. The server 140 may storethe audio fingerprints at the data store 146. Upon receipt of theunknown audio fingerprint 123, the unordered fingerprint matching module142 may perform unordered comparisons between the unknown audiofingerprint 123 and various known audio fingerprints that are stored inthe data store 146. In a particular aspect, the server 140 may performone or more actions when a match between the unknown fingerprint 123 anda known audio fingerprint is detected. For example, the server 140 maytransmit advertisement/song/station identification information to thelistening device 122. As another example, the server 140 may store(e.g., in a database) data identifying the station associated with theknown audio fingerprint 133, the timestamp corresponding to the unknownaudio fingerprint 123, and an identifier of the user 121. The databasemay subsequently be used to determine station and song listenership.Alternately, or in addition, the data may be sold or licensed to thirdparties.

The system 100 of FIG. 1 may thus enable unordered matching betweenunknown and known audio fingerprints. Performing comparisons of audiofingerprints that are generated from raw audio signals may be morerobust than comparisons using metadata. To illustrate, in somesituations, the known and unknown audio fingerprints may be generatedsubstantially concurrently. For example, when being used to determineradio listenership, the listening device 122 may generate the firstaudio fingerprint 123 at substantially the same time as the first fieldrecorder 130 generates the second audio fingerprint 133. In such “live”situations, the audio fingerprints 123, 133 may represent unanticipatedor unscripted content. For example, radio noise/distortion, disc jockey(DJ) chatter, etc. may be in audio captured by the listening device 122and the field recorder 130. It will be appreciated, however, thatbecause such unanticipated content is in both audio fingerprints 123 and133, a match between the audio fingerprints may still be identified.This may also enable a user to receive correct identification of a songthat is currently playing on a radio station, despite the presence ofnoise, DJ chatter, etc. To illustrate, the song may be identified viathe following two steps: 1) match fingerprints to identify the station,and 2) cross reference the timestamp with a known playlist of songsbroadcast by the station to identify the song. In other situations, theunknown audio fingerprint 123 may be matched with a known audiofingerprint that was received by the server 140 minutes, hours, or evendays prior to receipt of the unknown audio fingerprint 123. For example,such a comparison may be used when determining how many times a radiostation repeated a particular song/advertisement or how many times aparticular user listened to the particular song/advertisement over thecourse of a day, a week, etc. As another example, such a comparison maybe used to identify songs, advertisements, or programs that are playedin a time-shifted fashion (e.g., using a digital video recorder (DVR) orother time-shifting device), so that time-shifted listenership orviewership ratings can be determined (e.g., live-plus ratings, whichindicate total listeners/viewers within a period of time, such as aweek, following a broadcast).

FIGS. 2-9 illustrate a particular aspect of performing unorderedmatching of audio fingerprints. Turning to FIG. 2 , at 210, a portion ofa known audio fingerprint that is to be “scrubbed” against an incomingunknown audio fingerprint is selected as a probe. In a particularaspect, the probe includes or represents sixteen audio samples that areeach one tenth of a second in length, where each audio sample includes48 bits. Thus, the probe may represent 1.6 seconds of audio that can bevisualized as a 16×48 grid of bits. It will be appreciated thatselecting a probe that represents sixteen audio samples may bepreferable to selecting a probe representing only one audio sample,especially in situations where time-stretching or time-squeezing may bepresent, because a sliding window of sixteen samples may be more likelyto produce a match than a single sample.

At 220, the probe is “scrubbed” against a segment of the unknown audiofingerprint to determine whether the probe sufficiently (e.g.,substantially) matches any portion of the unknown audio fingerprint. Thesegment of the unknown audio fingerprint that the probe is beingscrubbed against may be considered a “scrub window.” In a particularaspect, the probe is determined to substantially match a portion of theunknown audio fingerprint when the probe and the portion have a hammingdistance that is less than a threshold. If the probe does not match anyportion within the scrub window, the scrub window may be advanced.Alternately, or in addition, another probe may be selected. If the scrubwindow cannot be advanced (e.g., the end of the known audio fingerprintis reached), a different known audio fingerprint may be selected andretrieved for comparison. In a particular aspect, the probe may bescrubbed against multiple known audio fingerprints simultaneously tomore quickly identify a match between the unknown audio fingerprint anda known audio fingerprint.

When a sufficient match between the probe and a portion of the unknownaudio fingerprint is detected, additional portions of the known audiofingerprint may be compared against additional portions of the unknownaudio fingerprint, at 230. However, unlike ordered matching, whichattempts to “grow” the match backwards and forwards in time, theunordered matching techniques described herein compare each portion ofthe known audio fingerprint (or segment thereof) with each portion ofthe unknown audio fingerprint (or segment thereof). Thus, unlike orderedmatching, unordered matching may include comparing portions of the knownaudio fingerprint with non-corresponding and non-consecutive portions ofthe unknown audio fingerprint, and vice versa. To illustrate, theunknown audio fingerprint may include X portions of spectral data andthe known audio fingerprint may include Y portions of spectral data (oneof which is the probe), where X and Y are integers greater than one. Thespectral data for the audio fingerprints may be generated via spectralanalysis. For example, spectral data in an audio fingerprint may includetransform (e.g., fast Fourier Transform (FFT)) coefficients, melfrequency cepstral coefficients (MFCCs), spectral flatness information,sharpness information, linear predictive coding (LPC) coefficients, etc.After the probe is determined to sufficiently match one of the Xportions, each of the X portions may be compared to each of the Yportions, thereby generating X*Y match scores. It should be noted thatalthough the X portions of the unknown audio fingerprint and the Yportions of the known audio fingerprint are illustrated in FIG. 2 asbeing the same size, this is for illustration only. In alternateaspects, the known audio fingerprint may be broken up into differentsize pieces (e.g., to balance processor usage, noise tolerance, remixtolerance, etc.). Further, although FIG. 2 illustrates that X and Y areboth equal to ten, this is for illustration only. In alternate aspects,X may be larger or smaller than Y.

Advancing to FIG. 3 , an exemplary table 300 of the X*Y match scores isillustrated. In the example shown, the match scores vary from one toten, with one representing the weakest possible match and tenrepresenting the strongest possible match. In alternate aspects, adifferent range of match scores may be used. In a particular aspect, thematch scores are a function of hamming distance. The X*Y match scoresmay be visualized as an undulating surface. For example, FIG. 4illustrates a surface graph 400 corresponding to the match scores in thetable 300 of FIG. 3 . Surface graphs having a tall and flat region mayindicate a greater likelihood of a match than surface graphs that areshort or that have many closely spaced peaks and valleys.

After the X*Y match scores are computed, a highest match score for eachof the X portions of the unknown audio fingerprint may be identified.For example, as illustrated in FIGS. 3-4 , the highest match score forX=1 is 7 (corresponding to Y=1), the highest match score for X=2 is 4(corresponding to Y=2), etc. FIG. 5 illustrates a bar graph 500representing the highest match scores from the table 300. In aparticular aspect, if enough of the X portions (or a long enoughsequence of the X portions) have match scores that are greater than athreshold, an overall match between audio fingerprints may be detected.Alternately, additional operations may be performed, as furtherdescribed with reference to FIGS. 6-9 .

For example, it will be appreciated that the highest match score foreach X value may not always represent the “best” match. To illustrate,consider X=9 and X=10. The highest scores for both of these X valuescorresponds to Y=9. Thus, Y=9 is being “repeated” in the highest matchscores, indicating that the audio data corresponding to Y=9 isdetermined to repeat multiple times in the unknown fingerprint. Insituations where remixing or editing of audio is anticipated, suchrepetition may be acceptable. However, in other situations, suchrepetition may be unacceptable, and short segments of audio data mayresult in incorrect matches. For example, a station may cut a song intopieces (e.g., 30 second pieces) and may interleave the pieces withpieces of other songs in a remix. Occasionally, spectral analysis of ashort piece of a song may result in an audio fingerprint that resemblesrandom signal noise, such as signal noise that is generated when a radiostation goes offline or is experiencing an error. When a station goesoffline or experiences an error, the field recorder assigned to thestation may record noise that is periodic in nature (e.g., due toeffects such as gain boost, alternating current (AC) hum in the fieldrecorder, etc.) and that causes a repeating pattern in the audiofingerprint(s) corresponding to the station. Thus, a stored fingerprintrepresenting such repetitious noise may be matched with a remixed pieceof a song.

To control whether repetition is permitted during fingerprint matching,a disorder penalty may be applied based on a disorder threshold (D).When D=1, each portion of the known audio fingerprint can only appearonce in the unknown audio fingerprint, and thus can only contribute onceas a highest match score. Conversely, when D is infinity, each portionof the known fingerprint can be repeated an unlimited number of times inthe unknown audio fingerprint. FIG. 6 illustrates a bar graph 600 aftera disorder penalty is applied when D=1. In FIG. 6 , because Y=9 wasrepeated for X=9 and X=10, the highest match score for X=10 is changedfrom 4 to 2 (Y=10). Whether the disorder penalty is in effect and thevalue of the disorder threshold (D) may be configurable by a user (e.g.,the user 121 or an administrator of the server 140 of FIG. 1 ).

In a particular aspect, the following algorithm (hereinafter referred toas “Algorithm 1”) may be used to identify the highest match scores inview of the disorder penalty (i.e., generate the bar graph 600 of FIG. 6):

-   -   1) Generate a list of (X, Y, Score) tuples from the X*Y computed        match scores    -   2) Sort the list in descending order by Score, with a lower X        value breaking a tie between Scores and a lower Y value breaking        a double tie between Scores and X values    -   3) If D is infinity (or anything greater than or equal to Y),        choose the highest Score for each X value as the highest match        score for that X value    -   4) If D is less than Y, assign as the highest score for each X        value the first Score in the list where the Y value        corresponding to the Score has not already been used D times

In addition to the disorder penalty, a positional penalty may be appliedwhen determining highest match scores. It will be appreciated that whena received audio fingerprint and a stored audio fingerprint are aperfect match, consecutive portions of the received audio fingerprintswill best match (i.e., have highest match scores corresponding to)consecutive portions of the stored audio fingerprint. When this is notthe case (i.e., when the highest match scores for two consecutiveportions of the received audio fingerprint correspond to twonon-consecutive portions of the stored audio fingerprint), a positionalpenalty may be applied by scaling down match scores. FIG. 7 illustratesa bar graph 700 corresponding to the highest match scores of FIG. 6after application of a 10% positional penalty scales down the highestmatch scores for X=3, 4, 5, 6 from 10 to 9. Whether the positionalpenalty is in effect and the scaling amount corresponding to thepositional penalty may be configurable by a user (e.g., the user 121 oran administrator of the server 140 of FIG. 1 ).

The bar graph 700 of FIG. 7 thus represents the highest match scores foreach of the X portions of the unknown fingerprint, including applicationof any penalties that are in effect (e.g., the disorder penalty and thepositional penalty). The highest match scores may be converted into alist of alternating runs that are above and below a similaritythreshold. The similarity threshold may be user configurable. In theexample of FIG. 7 , the similarity threshold is equal to 5. Thus, thebar graph 700 can be converted into the following list of alternatingabove-threshold (AT) and (below-threshold) runs:

-   -   AT: (X=1, Score=7)    -   BT: (2, 4)    -   AT: (3, 9); (4, 9); (5, 9); (6, 9)    -   BT: (7, 2); (8, 3)    -   AT: (9, 7)    -   BT: (10, 2)

If the longest above-threshold run in the list of runs is sufficientlylong (e.g., satisfies the appropriate length criteria 144 of FIG. 1 ), amatch between the known and unknown fingerprints is detected. Asdescribed with reference to FIG. 1 , length criteria may beuser-configurable, may vary based on programming element, and/or mayvary based on station. In addition, length criteria may correspond to anabsolute length (e.g., 8 seconds) or a relative length (e.g., 80% of aknown audio fingerprint).

In a particular aspect, one or more averaging operations may beperformed prior to determining the longest above-threshold run inaccordance with the following algorithm (hereinafter referred to as“Algorithm 2”):

-   -   1) Iterate through the list of runs. For each below-threshold        run that is not the first or last run in the list of runs,        average the below-threshold run with the smaller of the        neighboring above-threshold runs. If the averaging operation        results in an above-threshold run, replace the below-threshold        run and both neighboring above-threshold runs with a single        aggregate above-threshold run having the average match score of        the below-threshold run and both neighboring above-threshold        runs.    -   2) If step 1 resulted in any modifications to the list of runs,        repeat step 1.    -   3) Identify the longest above-threshold run in the list of runs.    -   4) Iterate through the list of runs. For each above-threshold        run that is not the first or last run in the list of runs and        not the longest above-threshold run identified in step 3,        average the above-threshold run with the smaller of the        neighboring below-threshold runs. If the averaging operation        results in a below-threshold run, replace the above-threshold        run and both neighboring below-threshold runs with a single        aggregate below-threshold run having the average match score of        the above-threshold run and both neighboring below-threshold        runs.    -   5) If step 4 resulted in any modifications to the list of runs,        return to step 1.    -   6) Identify the longest above-threshold run in the list of runs        for comparison to the length criteria.

When Algorithm 2 is performed on the list of runs derived from FIG. 7 ,two aggregations occur. Step 1 of Algorithm 2 results in replacing theX=2 below-threshold run and the neighboring above-threshold runs for X=1and X=3, 4, 5, 6 with a single above-threshold run with a score of(7+4+9+9+9+9)/6=7.83. FIG. 8 illustrates a bar graph 800 with theaggregate run for X=1, 2, 3, 4, 5, 6.

Further, step 4 of Algorithm 2 results in replacing the X=9above-threshold run and the neighboring below-threshold runs for X=7, 8and X=10 with a single below-threshold run with a score of(2+3+7+2)/4=3.5. FIG. 9 illustrates a bar graph 900 with the aggregaterun for X=7, 8, 9, 10. After completion of Algorithm 2, the longestabove-threshold run, i.e., the X=1, 2, 3, 4, 5, 6 run, is identified asthe longest unordered match between the received audio fingerprint andthe stored audio fingerprint. As described with reference to FIG. 2 ,each X value corresponds to a portion of the received audio fingerprintthat is 1.6 seconds in length. Thus, the longest unordered match has alength of 6*1.6=9.6 seconds, identifying the longest consecutive segmentof the unknown audio fingerprint that has match scores above thethreshold. However, because the match is unordered, it should be notedthat the 9.6 second segment of the unknown fingerprint need not havebeen determined to match 9.6 consecutive seconds of the knownfingerprint. If 9.6 seconds satisfies (e.g., is greater than or equalto) the applicable length criteria, a match between the received(unknown) audio fingerprint and the stored (known) audio fingerprint isdetected, and identification data (e.g., station, timestamp, user,location, etc.) representing the match may be stored in a database. In aparticular aspect, the received audio fingerprint, which was previouslyunknown but can now be considered known, may be stored (e.g., in thedata store 146 of FIG. 1 ) for retrieval and comparison to subsequentlyreceived unknown audio fingerprints.

It should be noted that the various penalties (e.g., the disorderpenalty and the positional penalty) and algorithms (e.g., Algorithm 1 todetermine highest match scores and Algorithm 2 to perform averagingoperations) are to be considered illustrative and not limiting. Inalternate aspects, other penalties/algorithms may be used, penalties maynot be used, or penalties may be optional. Thus, the present disclosureis not limited by the specific examples, aspects, and algorithmsdescribed.

FIG. 10 is a flow chart to illustrate a particular aspect of a method1000 of performing unordered matching of audio fingerprints. In aparticular aspect, the method 1000 may be performed by the system 100 ofFIG. 1 and may be illustrated with reference to FIGS. 2-9 .

The method 1000 may include receiving an audio fingerprint from alistening device, at 1002. For example, in FIG. 1 , the server 140 mayreceive the first (e.g., unknown) audio fingerprint 123 from thelistening device 122.

The method 1000 may also include selecting a probe from a stored audiofingerprint and comparing the probe to portions of the received audiofingerprint, at 1004. For example, in FIG. 1 , the second (e.g., known)audio fingerprint 133 may have been received from the field recorder 130and stored in the data store 146, and the unordered fingerprint matchingmodule 142 may retrieve and select a probe from the second audiofingerprint 133. In an illustrative aspect, the probe may be 1.6 secondslong and may be selected as described with reference to FIG. 2 . Forexample, the probe may be a randomly selected sixteen sample portion ofthe second audio fingerprint 133, may be the first (e.g., initial)sixteen samples of the second audio fingerprint 133, or may be selectedusing another method.

The method 1000 may further include determining whether the probesubstantially matches a portion of the received audio fingerprint (e.g.,within a scrub window), at 1006. When the probe does not substantiallymatch a portion of the audio fingerprint, the method 1000 may return to1002 and attempt to find a match with respect to a different section(e.g., scrub window) of the received audio fingerprint and/or withrespect to a different stored audio fingerprint.

When the probe substantially matches a portion of the received audiofingerprint, the method 1000 may include identifying a longest unorderedmatch between the received and stored audio fingerprints that satisfiesa similarity threshold, at 1008. In selected aspects, the longestunordered match may be determined based on computation of match scores,identification of highest match scores, application of a disorderpenalty, application of a positional penalty, and/or performing ofaveraging operations as described with reference to FIGS. 2-9 . Aparticular example of identifying a longest unordered match is furtherdescribed with reference to FIGS. 11-12 .

The method 1000 may include determining whether the longest unorderedmatch satisfies a length criterion, at 1010. The length criterion mayvary based on programming element and/or station. For example, in FIG. 1, the unordered fingerprint matching module 142 may determine whetherthe longest unordered match satisfies one or more of the length criteria144. When the longest unordered match does not satisfy the lengthcriterion, the method 1000 may return to 1002 and attempt to find amatch with respect to a different section (e.g., scrub window) of thereceived audio fingerprint and/or with respect to a different storedaudio fingerprint.

When the longest unordered match satisfies the length criterion, themethod 1000 may include detecting a match between the received andstored audio fingerprints, at 1012. In addition, data indicating astation, a timestamp, and a user may be stored (e.g., in a database).

FIG. 11 is a flow chart to illustrate a particular aspect of a method1100 of identifying a longest unordered match. In a particular aspect,the method 1100 may be performed by the system 100 of FIG. 1 and may beillustrated with reference to FIGS. 2-9 . The method 1100 may correspondto step 1008 of FIG. 10 and may be used to identify a longest unorderedmatch between a received audio fingerprint and a stored audiofingerprint. The received audio fingerprint may include X portions ofspectral data and the stored audio fingerprint may include Y portions ofspectral data, where X and Y are integers greater than one.

The method 1100 may include computing match scores for each of the Xportions of the received audio fingerprint with respect to each of the Yportions of the stored fingerprint to generate X*Y match scores, at1102. For example, the X*Y match scores may be the match scores that areshown in the table 300 of FIG. 3 and in the surface graph 400 of FIG. 4.

The method 1100 also includes identifying a highest match score for eachof the X portions, at 1104. Match scores that violate a disorderthreshold may be excluded. For example, the highest match scorescorresponding to the bar graph 600 of FIG. 6 may be identified, wherethe match score of 4 for X=10 is excluded due to application of thedisorder penalty where the disorder threshold D=1.

The method 1100 may further include applying a positional penalty to atleast one highest match score (e.g., by scaling the at least one highestmatch score) in response to determining that the highest match scoresfor two consecutive portions of the audio fingerprint correspond to twonon-consecutive portions of the stored audio fingerprint, at 1106. Forexample, a 10% positional penalty may be applied to the match scores forX=3, 4, 5, 6, as shown in the bar graph 700 of FIG. 7 .

The method 1100 may include generating a list of runs based on theidentified highest match score for each of the X portions, at 1108. Thelist of runs may include alternating below-threshold runs (which haveidentified match scores below the similarity threshold) andabove-threshold runs (which have identified match scores above thesimilarity threshold). The method 1100 may also include identifying thelongest unordered match based on the list of runs, at 1110. The method1100 of FIG. 11 may thus enable application of disorder and positionpenalties when identifying a longest unordered match, which may resultin more accurate identification of matches between known and unknownaudio fingerprints.

FIG. 12 is a flow chart to illustrate another particular aspect of amethod 1200 of identifying a longest unordered match based on a list ofruns, corresponding to Algorithm 2 described above. In a particularaspect, the method 1200 may be performed by the system 100 of FIG. 1 ,may be illustrated with reference to FIGS. 2-9 , and may correspond tostep 1110 of FIG. 11 .

At 1202, the method 1200 may include iterating through the list of runs.Each below-threshold run that isn't the first or last run in the list ofruns may be averaged with the smaller of the neighboring above-thresholdruns. If the averaging operation results in an above-threshold run, thebelow-threshold run and the neighboring above-threshold runs may bereplaced with an aggregate above-threshold run. For example, referringto FIG. 8 , a single aggregate above-threshold run may be generated forX=1, 2, 3, 4, 5, 6.

Continuing to 1204, the method 1200 may include determining whether step1202 resulted in a modification to the list of runs. If so, the method1200 may return to 1202. If not, the method 1200 may advance to 1206 andmay identify the longest above-threshold run in the list of runs.

At 1208, the method 1200 may include iterating through the list of runs.Each above-threshold run that is not the first or last run in the listof runs and is not the run identified in step 1206 may be averaged withthe smaller of the neighboring below-threshold runs. If the averagingoperation results in a below-threshold run, the above-threshold run andthe neighboring below-threshold runs may be replaced with an aggregatebelow-threshold run. For example, referring to FIG. 9 , a singleaggregate below-threshold run may be generated for X=7, 8, 9, 10.

Continuing to 1210, the method 1200 may include determining whether step1208 resulted in a modification to the list of runs. If so, the method1200 returns to 1202. If not, the method 1200 advances to 1212 andidentifies the longest above-threshold run in the list of runs as thelongest unordered match. For example, referring to FIG. 9 , theabove-threshold run for X=1, 2, 3, 4, 5, 6 may be identified as thelongest unordered match. If the longest unordered match satisfies alength criterion, an overall match may be detected between audiofingerprints.

FIG. 13 is a block diagram of a computing environment 1300 including acomputing device 1310 that is operable to support aspects ofcomputer-implemented methods, computer program products, and systemcomponents according to the present disclosure.

The computing device 1310 includes at least one processor 1320 and asystem memory 1330. For example, the computing device 1310 may be adesktop computer, a laptop computer, a tablet computer, a server, acloud computing device, or any other fixed or mobile computing device.Depending on the configuration and type of computing device, the systemmemory 1330 may include volatile (such as random access memory or“RAM”), non-volatile (such as read-only memory or “ROM,” flash memory,and similar memory devices that maintain stored data even when power isnot provided), a combination thereof, or some other memory. The systemmemory 1330 may store an operating system 1332. The system memory 1330may also store an unordered fingerprint matching module 1334 and programdata 1338. In an illustrative aspect, the unordered fingerprint matchingmodule 1334 is the unordered fingerprint matching module 142 of FIG. 1and the program data 1338 includes the length criteria 144 of FIG. 1 .

The computing device 1310 may also have additional features orfunctionality. For example, the computing device 1310 may also includeremovable and/or non-removable additional data storage devices, such asmagnetic disks, optical disks, tape, and memory cards. Such additionalstorage is illustrated in FIG. 13 by a data store 1340. In anillustrative aspect, the data store 1340 is the data store 146 of FIG. 1. Computer-readable or processor-readable storage media may includevolatile and/or non-volatile storage and removable and/or non-removablemedia implemented in any technology for storage of information such ascomputer-readable instructions, data structures, program components orother data. The system memory 1330 and the data store 1340 are examplesof computer storage media. The computer storage media includes, but isnot limited to, RAM, ROM, electrically erasable programmable read-onlymemory (EEPROM), flash memory or other memory technology, compact disks(CD), digital versatile disks (DVD) or other optical storage, magneticcassettes, magnetic tape, magnetic disk storage or other magneticstorage devices, and other non-transitory media that can be used tostore information and that can be accessed by the computing device 1310.Any such computer storage media may be part of the computing device1310.

The computing device 1310 may also have one or more input devices, suchas an external device 1362 connected via one or more input interfaces1360. One or more output devices, such as an illustrative display device1392, speakers, a printer, etc. may also be connected to the computingdevice 1310 via one or more output interfaces 1370. The input interfaces1360 and the output interfaces 1370 may each include one or more wiredor wireless interfaces, such as a universal serial bus (USB) interface,a video graphics array (VGA) interface, a serial interface, a digitalvisual interface (DVI), a high-definition multimedia interface (HDMI),or some other interface. In certain aspects, such as when the computingdevice 1310 is the server 140 of FIG. 1 , the input interfaces 1360 andthe output interfaces 1370 may not be included.

The computing device 1310 has one or more communication interfaces 1380that enable the computing device 1310 to communicate (e.g., via anetwork) with other computing devices, such as a listening device 1382and a field recorder 1384. In an illustrative aspect, the listeningdevice 1382 is the listening device 122 of FIG. 1 and the field recorder1384 is one of the field recorders 130 or 160 of FIG. 1 .

Particular aspects of disclosed techniques may be implemented inconjunction with a client-server architecture. To illustrate, thecomputing device 1310 may be an application server or other server thatprovides unordered fingerprint matching functionality. Clients (e.g.,the listening device 1382 and the field recorder 1384) may transmitknown and unknown audio fingerprints to the server for storage in thedata store 1340 and or unordered fingerprint matching by the module1334.

It will be appreciated that not all of the components or devicesillustrated in FIG. 13 or otherwise described in the previous paragraphsare necessary to support aspects as herein described. It will also beappreciated that the computing device 1310 may have additional ordifferent components or devices than illustrated in FIG. 13 or otherwisedescribed in the previous paragraphs.

Although the exemplary aspects described herein are intended to enable aperson skilled in the art to practice such aspects, it should beunderstood that other aspects may be realized and that logical andphysical changes may be made without departing from the scope of thepresent disclosure. Thus, the detailed description herein is presentedfor purposes of illustration only.

In one aspect, portions of the present disclosure may be implementedusing a system that includes a software module, logic engines, computerhardware, databases, and/or computer networks. Moreover, while thedescription may make reference to specific technologies, systemarchitectures, and data management techniques, it will be appreciatedthat other devices and/or methods that use different technologies,architectures, or techniques may be implemented without departing fromthe scope of the disclosure. This disclosure is intended to cover anyand all subsequent adaptations or variations of various aspects.

The Abstract is not intended to be used in interpreting or limiting thescope or meaning of the claims. In addition, the disclosure is not to beinterpreted as indicating that the claimed aspects require more featuresthan are expressly recited in each claim. Thus, the present disclosureis not intended to be limited to the aspects shown herein but is to beaccorded the widest scope possible consistent with the principles andnovel features as defined by the following claims.

What is claimed is:
 1. A computing system comprises: an interfaceconfigured to interface and communicate with an external media resource;memory that stores operational instructions; and a processing moduleoperably coupled to the interface and to the memory, wherein theprocessing module, when operable within the computing system based onthe operational instructions, is configured to: receive an audiofingerprint from an external medial resource, wherein the received audiofingerprint includes a plurality of portions; compare the received audiofingerprint with a stored audio fingerprint, wherein the stored audiofingerprint includes a plurality of portions; in response to determiningthat a portion of a stored audio fingerprint substantially matches aportion of the received audio fingerprint: compare a first set ofconsecutive portions of the plurality of portions of the received audiofingerprint to each of a plurality of consecutive portions of the storedaudio fingerprint to generate corresponding match scores; identify alongest unordered match as a number of consecutive portions of the firstset that each have a corresponding highest match score satisfying asimilarity threshold; and when the longest unordered match comparesfavorably to a length criterion, determine a match between the receivedaudio fingerprint and the stored audio fingerprint.
 2. The computingsystem of claim 1, wherein the external media resource is a listeningdevice.
 3. The computing system of claim 1, wherein the listening deviceis selected from a list comprising at least one of a microphone, amobile telephone and a personal media device.
 4. The computing system ofclaim 1, wherein the external media resource is a field recorder.
 5. Thecomputing system of claim 1, further comprising an output interface. 6.The computing system of claim 1, further comprising an external inputdevice.
 7. The computing system of claim 1, further comprising one ormore data storage devices.
 8. The computing system of claim 1, whereinthe length criterion is user definable.
 9. The computing system of claim1, wherein the plurality of portions of the received audio fingerprintinclude X portions of spectral data, wherein the plurality of portionsof the stored audio fingerprint include Y portions of spectral data andX and Y are integers greater than one.
 10. The computing system of claim9, wherein the processing module, when operable within the computingsystem based on the operational instructions, is further configured to:compute match scores for each of the X portions of spectral data of thereceived audio fingerprint based on a comparison with each of the Yportions of spectral data of the received audio fingerprint; identify ahighest score of the match scores for each of the X portions of thereceived audio fingerprint; generate a list of runs based on theidentified highest score of the match scores for each of the X portions;and identify the longest unordered match based on the list of runs. 11.A non-transient computer readable medium containing program instructionsfor causing a computer to perform the method of: receiving an audiofingerprint from an external medial resource, wherein the received audiofingerprint includes a plurality of portions; comparing the receivedaudio fingerprint with a stored audio fingerprint, wherein the storedaudio fingerprint includes a plurality of portions; in response todetermining that a portion of a stored audio fingerprint substantiallymatches a portion of the received audio fingerprint: comparing a firstset of consecutive portions of the plurality of portions of the receivedaudio fingerprint to each of a plurality of consecutive portions of thestored audio fingerprint to generate corresponding match scores;identifying a longest unordered match as a number of consecutiveportions of the first set that each have a corresponding highest matchscore satisfying a similarity threshold; and when the longest unorderedmatch compares favorably to a length criterion, determining a matchbetween the received audio fingerprint and the stored audio fingerprint.12. The computer readable medium of claim 11, wherein the external mediaresource is a listening device.
 13. The computer readable medium ofclaim 12, wherein the listening device is selected from a listcomprising at least one of a microphone, a mobile telephone and apersonal media device.
 14. The computer readable medium of claim 11,wherein the external media resource is a field recorder.
 15. Thecomputer readable medium of claim 11, wherein the computer readablemedium contains program instructions for causing the computer to outputa result via an output interface.
 16. The computer readable medium ofclaim 11, wherein the computer readable medium contains programinstructions for causing the computer to perform the method of:receiving data via an external input device.
 17. The computer readablemedium of claim 11, wherein the computer readable medium containsprogram instructions for causing the computer to perform the method of:managing one or more data storage devices.
 18. The computer readablemedium of claim 11, wherein the length criterion is user definable. 19.The computer readable medium of claim 11, wherein the plurality ofportions of the received audio fingerprint include X portions ofspectral data, wherein the plurality of portions of the stored audiofingerprint include Y portions of spectral data and X and Y are integersgreater than one.
 20. The computer readable medium of claim 19, whereinthe computer readable medium contains program instructions for causingcomputer to perform the method of: computing match scores for each ofthe X portions of spectral data of the received audio fingerprint basedon a comparison with each of the Y portions of spectral data of thereceived audio fingerprint; identifying a highest score of the matchscores for each of the X portions of the received audio fingerprint;generating a list of runs based on the identified highest score of thematch scores for each of the X portions; and identifying the longestunordered match based on the list of runs.